Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
نویسندگان
چکیده
منابع مشابه
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
In this sequel to [HM02], we explore some of the global aspects of the category of paracategories. We establish its (co)completeness and cartesian closure. From the closed structure we derive the relevant notion of transformation for paracategories. We set-up the relevant notion of adjunction between paracategories and apply it to define (co)completeness and cartesian closure, exemplified by th...
متن کاملIoco Theory for Probabilistic Automata
Model-based testing (MBT) is an well-known technology, which allows for automatic test case generation, execution and evaluation. To test non-functional properties, a number of test MBT frameworks have been developed to test systems with real-time, continuous behaviour, symbolic data and quantitative system aspects. Notably, a lot of these frameworks are based on Tretmans’ classical input/outpu...
متن کاملExamples of Special Lagrangian Fibrations
Of late there has been a great deal of interest in special Lagrangian submanifolds and manifolds fibred in special Lagrangian submanifolds, motivated by the Strominger-Yau-Zaslow conjecture [29]. One of the basic approaches to finding examples is to exploit symmetries of the ambient manifold. If X is a (non-compact) n-dimensional Calabi-Yau manifold with Kähler form ω and nowhere vanishing holo...
متن کاملFibrations of Tree Automata
We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winning strategies on a synchronous restriction of the linear implication between acceptance games. This leads to split indexed categories, with substitution based on a suitable notion of synchronous tree function. By restricting to tree functions issued from maps on alphabets, this gives a fibration o...
متن کاملAnalysis of Probabilistic Processes and Automata Theory
This chapter surveys some basic algorithms for analyzing Markov chains (MCs) and Markov decision processes (MDPs), and discusses their computational complexity. We focus on discrete-time processes, and we consider both finite-state models as well as countably infinite-state models that are finitely-presented. The analyses we will primarily focus on are hitting (reachability) probabilities and ω...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00317-7